全文获取类型
收费全文 | 137篇 |
免费 | 54篇 |
国内免费 | 8篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 19篇 |
2013年 | 13篇 |
2012年 | 15篇 |
2011年 | 11篇 |
2010年 | 7篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 13篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有199条查询结果,搜索用时 109 毫秒
71.
基于SpaceWire网络在热点通信模式下的工作特点,研究缓存资源的分配算法。给出均匀通信模式和热点通信模式的释义;推导网络路由节点的满负荷概率和平均延时的解析方法,计算网络中的关键通信节点;再给出SpaceWire网络缓存资源分配算法。利用Opnet网络仿真平台建立SpaceWire通信模型,仿真了不同通信模式中采用缓存优化策略前后的关键性能指标。研究结果表明:在热点通信模式状态下,该缓存资源分配算法在保证总资源一定的前提下,网络系统的平均延时降低,优化了SpaceWire网络性能。 相似文献
72.
新一代面向密集计算的高性能处理器普遍采用分布式寄存器文件来支撑ALU阵列,并通过VLIW开发指令级并行.面向分布式寄存器文件的编译成为新兴的研究热点,在斯坦福大学的kernelC编译器ISCD中最早提出了面向分布式寄存器的VLIW调度问题,在该领域处于领先水平,但是没有解决重负载下的分布式寄存器分配问题,使应用编程受到极大限制.在其基础上提出了一种新的VLIW调度策略,实验结果表明能够很好地解决重负载下的分布式寄存器分配问题. 相似文献
73.
为配合布达拉宫的消防工程改造,优化其建筑灭火设施的配置,针对现阶段布达拉宫建筑灭火设施现状,剖析了其存在的问题和缺陷,介绍了国外文物古建筑消防保护的理念,阐明了古建筑灭火设施优化配置应遵循的原则,通过对各类灭火设施保护宫殿的可行性和适用性分析,提出了布达拉宫古建筑灭火设施优化配置方案。 相似文献
74.
This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1~0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016 相似文献
75.
耐久性及其在装备研制中的应用 总被引:1,自引:0,他引:1
机械产品在武器装备中占有较大的比例,机械产品的故障,有很多是由于疲劳、磨损、腐蚀、老化等渐变性的耗损过程造成的,寿命是机械产品可靠性中的重要问题。耐久性的提出为解决机械产品与寿命有关的问题提供了方法和工具。通过探讨耐久性的定义、极限状态、耐久性参数、耐久性分配与预计等有关耐久性的基本问题,给出了耐久性分配与预计的工程实例。 相似文献
76.
77.
Hanan Luss 《海军后勤学研究》2010,57(3):266-278
Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
78.
79.
Kyle Y. Lin 《海军后勤学研究》2014,61(1):56-65
Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014 相似文献
80.
装备完好率要求和人才成长规律的维修任务分配方法 总被引:1,自引:0,他引:1
装备完好率是军事单位战备完好性水平的重要组成部分,人才的成长需要在实践中锻炼,针对我军装备维修任务分配难题,根据不同维修级别的情况,分析维修任务分配对装备完好率水平和人才成长的影响,提出基于装备完好率要求和人才成长规律的维修任务分配方法,建立了基于装备完好率要求和装备保障人才成长规律模型,此方法对于提高装备完好率水平和装备人才成长建设具有十分重要的意义。最后,用实例对方法的正确性进行了说明和验证,实例结果表明,该方法更贴近部队实际,对于部队的维修任务分配有重要的指导作用。 相似文献